Two relations between the parameters of independence and irredundanceFAVARON, O.Discrete mathematics. 1988, Vol 70, Num 1, pp 17-20, issn 0012-365XArticle

Graph properties and hypergraph colouringsBROWN, J. I; CORNEIL, D. G.Discrete mathematics. 1991, Vol 98, Num 2, pp 81-93, issn 0012-365XArticle

On the sum of two parameters concerning independence and irredundance in a graphCHENGDE WANG.Discrete mathematics. 1988, Vol 69, Num 2, pp 199-202, issn 0012-365XArticle

Toppling kings in a tournament by introducing new kingsHUANG JING; LI WEIXUAN.Journal of graph theory. 1987, Vol 11, Num 1, pp 7-11, issn 0364-9024Article

Ecken von kleinem grad in kritisch n-fach zusammenhängenden diagraphenMADER, W.Journal of combinatorial theory. Series B. 1991, Vol 53, Num 2, pp 260-272, issn 0095-8956Article

On the number of irregular assignments on a graphEBERT, G; HEMMETER, J; LAZEBNIK, F et al.Discrete mathematics. 1991, Vol 93, Num 2-3, pp 131-142, issn 0012-365XArticle

Generating projective plane polyhedral mapsBARNETTE, D. W.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 2, pp 277-291, issn 0095-8956Article

On the diameter of a class of random graphsPHILIPS, T. K; TOWSLEY, D. F; WOLF, J. K et al.IEEE transactions on information theory. 1990, Vol 36, Num 2, pp 285-288, issn 0018-9448Article

Almost every randomly near-traceable graph has diameter at most twoBING ZHOU.SIAM journal on discrete mathematics. 1988, Vol 1, Num 2, pp 260-268Article

End vertices in interval graphsGIMBEL, J.Discrete applied mathematics. 1988, Vol 21, Num 3, pp 257-259, issn 0166-218XArticle

The average size of an independent set in graphs with a given chromatic numberNILLI, A.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 1, pp 112-114, issn 0095-8956Article

Color-reversal by local complementationSABIDUSSI, G.Discrete mathematics. 1987, Vol 64, Num 1, pp 81-86, issn 0012-365XArticle

Expanding graphs contain all small treesFRIEDMAN, J; PIPPENGER, N.Combinatorica (Print). 1987, Vol 7, Num 1, pp 71-76, issn 0209-9683Article

Computing rooted communication reliability in an almost acyclic digraphHAGSTROM, J. N.Networks (New York, NY). 1991, Vol 21, Num 5, pp 581-593, issn 0028-3045Article

A Mengerian theorem for infinite graphs with ideal pointsPOLAT, N.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 2, pp 248-255, issn 0095-8956Article

Neighborhood conditions and edge-disjoint perfect matchingsFAUDREE, R. J; GOULD, R. J; LESNIAK, L. M et al.Discrete mathematics. 1991, Vol 91, Num 1, pp 33-43, issn 0012-365XArticle

Extensions of Gallai's graph covering theorems for uniform hypergraphsTUZA, Z.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 1, pp 92-96, issn 0095-8956Article

Infinite friendship graphs with infinite parametersHAHN, G; MILNER, E. C; WOODROW, R. E et al.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 1, pp 30-41, issn 0095-8956Article

On multipartite tournamentsGODDARD, W. D; KUBICKI, G; OELLERMANN, O. R et al.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 2, pp 284-300, issn 0095-8956Article

On the diameter of the edge cover polytopeHURKENS, C. A. J.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 2, pp 271-276, issn 0095-8956Article

The physical meaning of topological indicesLABANOWSKI, J. K; MOTOC, I; DAMMKOEHLER, R. A et al.Computers & chemistry. 1991, Vol 15, Num 1, pp 47-53, issn 0097-8485Article

Hamiltonian circuits in N₂-locally connected K_1,3-free graphsRYJACEK, Z.Journal of graph theory. 1990, Vol 14, Num 3, pp 321-331, issn 0364-9024Article

On the number of distinct forestsTAKACS, L.SIAM journal on discrete mathematics (Print). 1990, Vol 3, Num 4, pp 574-581, issn 0895-4801Article

A fast parallel algorithm to color a graph with Δ colorsKARCHMER, M; NAOR, J.Journal of algorithms (Print). 1988, Vol 9, Num 1, pp 83-91, issn 0196-6774Article

Degree sum for a triangle in a graphGENGHUA FAN.Journal of graph theory. 1988, Vol 12, Num 2, pp 249-263, issn 0364-9024Article